Minimal consistent DFA revisited
نویسندگان
چکیده
منابع مشابه
Minimal Synthesis of String To String Functions From Examples
We study the problem of synthesizing string to string transformations from a set of input/output examples. The transformations we consider are expressed using deterministic finite automata (DFA) that read pairs of letters, one letter from the input and one from the output. The DFA corresponding to these transformations have additional constraints, ensuring that each input string is mapped to ex...
متن کاملConstruction of a Minimal Deterministic Finite Automaton from a Regular Expression
This paper describes a method for constructing a minimal deterministic finite automaton (DFA) from a regular expression. It is based on a set of graph grammar rules for combining many graphs (DFA) to obtain another desired graph (DFA). The graph grammar rules are presented in the form of a parsing algorithm that converts a regular expression R into a minimal deterministic finite automaton M suc...
متن کاملOn the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs
We study the state complexity of the reverse of acyclic minimal deterministic finite automata, and the computational complexity of the following problem: Given an acyclic minimal DFA, is the minimal DFA for the reverse also acyclic? Note that we allow self-loops in acyclic automata. We show that there exists a language accepted by an acyclic minimal DFA such that the minimal DFA for its reverse...
متن کاملMinimal DFA for Symmetric Difference NFA
Recently, a characterization of the class of nondeterministic finite automata (NFAs) for which determinization results in a minimal deterministic finite automaton (DFA), was given in [2]. We present a similar result for the case of symmetric difference NFAs. Also, we show that determinization of any minimal symmetric difference NFA produces a minimal DFA.
متن کاملar X iv : 1 41 2 . 16 41 v 1 [ cs . F L ] 4 D ec 2 01 4 On k - piecewise testability ( preliminary report )
A language is k-piecewise testable if it is a finite boolean combination of languages of the form Σa1Σ · · ·ΣanΣ, where ai ∈ Σ and 0 ≤ n ≤ k. We investigate the problem, given a minimal DFA recognizing a piecewise testable language, what is the minimal k for which the language is k-piecewise testable? It was shown by Klı́ma and Polák that such a k is bounded by the depth of the minimal DFA. We f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 647 شماره
صفحات -
تاریخ انتشار 2016